a bender’s decomposition algorithm for multi-objective hub location problem considering stochastic characteristics

نویسندگان

سعید عباسی پاریزی

دانش آموختة کارشناسی ارشد مهندسی صنایع دانشکدة مهندسی صنایع و تحلیل سیستم های دانشگاه امیرکبیر (پلی تکنیک تهران) مجید امین نیری

دانشیار گروه مهندسی صنایع دانشکدة مهندسی صنایع و تحلیل سیستم های دانشگاه امیرکبیر (پلی تکنیک تهران مهدی بشیری

دانشیار گروه مهندسی صنایع دانشکدة فنی و مهندسی دانشگاه شاهد

چکیده

in this paper, a multi-objective hub location problem considering stochastic links and candidate nodes characteristics is modeled. the first objective is to minimize total costs, including setup and transportation costs. the second one is to minimize network risks. characteristics such as weather conditions, safety, exchange rate, crisis, are defined as uncertainty parameters and considered as different scenarios. due to the size of the numbers of scenarios, it is assumed that the distribution of their risks is considered to be normal. also reliability levels associated to candidate hub nodes and links are considered as chance constraints. moreover a bender’s decomposition algorithm is utilized to solve the proposed model. in order to evaluate the performance of the proposed model, the results of this algorithm are compared to those of cplex solver. the comparison shows that cplex solver can solves small size problems but the bender’s decomposition algorithm is capable of solving problems of large scale as well as small ones.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Multi-objective Imperialist Competitive Algorithm for a Capacitated Single-allocation Hub Location Problem

In this paper, we present a novel multi-objective mathematical model for capacitated single allocation hub location problem. There are the vehicle capacity constraint and capacity restrictions amount of the incoming flow to the hub while the balancing requirements of incoming quantities of flow to the each hub is considered. Moreover, there is a set of available capacities for each potential hu...

متن کامل

Benders decomposition for the uncapacitated multiple allocation hub location problem

In telecommunication and transportation systems, the uncapacitated multiple allocation hub location problem (UMAHLP) arises when we must flow commodities or information between several origin–destination pairs. Instead of establishing a direct node to node connection from an origin to its destination, the flows are concentrated with others at facilities called hubs. These flows are transported ...

متن کامل

A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities

In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are in...

متن کامل

solving a multi-objective hub covering location problem with congestion by a new algorithm considering a queue theory

hub covering problem (hlp) is a very popular areas of research for its wide ranges of applications in different service or manufacturing industries. this paper considers a bi-objective hub covering location problem with congestion. the objectives minimize the total transportation cost and the total waiting time for all hobs, respectively. the resulted multi-objective decision-making problem is ...

متن کامل

A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem

In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...

متن کامل

Benders Decomposition for Large-Scale Uncapacitated Hub Location

This paper describes an exact algorithm capable of solving large-scale instances of an important hub location problem called the Uncapacitated Hub Location Problem with Multiple Assignments. The algorithm applies Benders decomposition to a strong path-based formulation of the problem. The standard decomposition algorithm is enhanced through the inclusion of several features such as the use of a...

متن کامل

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023